TSTP Solution File: ITP270^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP270^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:17:49 EDT 2024
% Result : Theorem 53.11s 14.41s
% Output : CNFRefutation 53.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 46 ( 15 unt; 14 typ; 0 def)
% Number of atoms : 59 ( 8 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 197 ( 29 ~; 15 |; 2 &; 141 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 0 ^ 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
num: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_318,type,
one_one_nat: nat ).
thf(decl_565,type,
suc: nat > nat ).
thf(decl_629,type,
bit0: num > num ).
thf(decl_631,type,
one: num ).
thf(decl_639,type,
numeral_numeral_nat: num > nat ).
thf(decl_679,type,
ord_less_nat: nat > nat > $o ).
thf(decl_694,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_742,type,
power_power_nat: nat > nat > nat ).
thf(decl_1087,type,
deg: nat ).
thf(decl_1089,type,
ma: nat ).
thf(decl_1090,type,
mi: nat ).
thf(decl_1094,type,
x: nat ).
thf(fact_330_order_Oasym,axiom,
! [X685: nat,X686: nat] :
( ( ord_less_nat @ X685 @ X686 )
=> ~ ( ord_less_nat @ X686 @ X685 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_330_order_Oasym) ).
thf(fact_1__C5_Ohyps_C_I8_J,axiom,
ord_less_nat @ ma @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__C5_Ohyps_C_I8_J) ).
thf(fact_2973_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2973_Suc__1) ).
thf(fact_602_dual__order_Ostrict__trans1,axiom,
! [X1331: nat,X1332: nat,X1333: nat] :
( ( ord_less_eq_nat @ X1331 @ X1332 )
=> ( ( ord_less_nat @ X1333 @ X1331 )
=> ( ord_less_nat @ X1333 @ X1332 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_602_dual__order_Ostrict__trans1) ).
thf(fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062,axiom,
( ( ord_less_eq_nat @ x @ ma )
& ( ord_less_eq_nat @ mi @ x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062) ).
thf(fact_346_antisym__conv3,axiom,
! [X74: nat,X724: nat] :
( ~ ( ord_less_nat @ X74 @ X724 )
=> ( ~ ( ord_less_nat @ X724 @ X74 )
<=> ( X724 = X74 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_346_antisym__conv3) ).
thf(conj_0,conjecture,
ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_512_leD,axiom,
! [X74: nat,X1156: nat] :
( ( ord_less_eq_nat @ X74 @ X1156 )
=> ~ ( ord_less_nat @ X1156 @ X74 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_512_leD) ).
thf(c_0_8,plain,
! [X685: nat,X686: nat] :
( ( ord_less_nat @ X685 @ X686 )
=> ~ ( ord_less_nat @ X686 @ X685 ) ),
inference(fof_simplification,[status(thm)],[fact_330_order_Oasym]) ).
thf(c_0_9,plain,
! [X26955: nat,X26956: nat] :
( ~ ( ord_less_nat @ X26955 @ X26956 )
| ~ ( ord_less_nat @ X26956 @ X26955 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
thf(c_0_10,plain,
ord_less_nat @ ma @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
inference(split_conjunct,[status(thm)],[fact_1__C5_Ohyps_C_I8_J]) ).
thf(c_0_11,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_2973_Suc__1]) ).
thf(c_0_12,plain,
! [X27079: nat,X27080: nat,X27081: nat] :
( ~ ( ord_less_eq_nat @ X27079 @ X27080 )
| ~ ( ord_less_nat @ X27081 @ X27079 )
| ( ord_less_nat @ X27081 @ X27080 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_602_dual__order_Ostrict__trans1])]) ).
thf(c_0_13,plain,
! [X17: nat,X1: nat] :
( ~ ( ord_less_nat @ X1 @ X17 )
| ~ ( ord_less_nat @ X17 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
ord_less_nat @ ma @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
! [X18: nat,X17: nat,X1: nat] :
( ( ord_less_nat @ X18 @ X17 )
| ~ ( ord_less_eq_nat @ X1 @ X17 )
| ~ ( ord_less_nat @ X18 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
ord_less_eq_nat @ x @ ma,
inference(split_conjunct,[status(thm)],[fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062]) ).
thf(c_0_17,plain,
! [X74: nat,X724: nat] :
( ~ ( ord_less_nat @ X74 @ X724 )
=> ( ~ ( ord_less_nat @ X724 @ X74 )
<=> ( X724 = X74 ) ) ),
inference(fof_simplification,[status(thm)],[fact_346_antisym__conv3]) ).
thf(c_0_18,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_19,plain,
! [X74: nat,X1156: nat] :
( ( ord_less_eq_nat @ X74 @ X1156 )
=> ~ ( ord_less_nat @ X1156 @ X74 ) ),
inference(fof_simplification,[status(thm)],[fact_512_leD]) ).
thf(c_0_20,plain,
~ ( ord_less_nat @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ) @ ma ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_21,plain,
! [X1: nat] :
( ( ord_less_nat @ X1 @ ma )
| ~ ( ord_less_nat @ X1 @ x ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
! [X26967: nat,X26968: nat] :
( ( ( ord_less_nat @ X26968 @ X26967 )
| ( X26968 = X26967 )
| ( ord_less_nat @ X26967 @ X26968 ) )
& ( ( X26968 != X26967 )
| ~ ( ord_less_nat @ X26968 @ X26967 )
| ( ord_less_nat @ X26967 @ X26968 ) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
thf(c_0_23,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,plain,
! [X27061: nat,X27062: nat] :
( ~ ( ord_less_eq_nat @ X27061 @ X27062 )
| ~ ( ord_less_nat @ X27062 @ X27061 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
thf(c_0_25,plain,
~ ( ord_less_nat @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ) @ x ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_26,plain,
! [X17: nat,X1: nat] :
( ( ord_less_nat @ X1 @ X17 )
| ( X1 = X17 )
| ( ord_less_nat @ X17 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ) ),
inference(rw,[status(thm)],[c_0_23,c_0_11]) ).
thf(c_0_28,plain,
! [X17: nat,X1: nat] :
( ~ ( ord_less_eq_nat @ X1 @ X17 )
| ~ ( ord_less_nat @ X17 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_29,plain,
( ( power_power_nat @ ( suc @ one_one_nat ) @ deg )
= x ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
thf(c_0_30,plain,
~ ( ord_less_nat @ ma @ x ),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
thf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP270^1 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n002.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sat May 18 16:54:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.18/0.48 Running higher-order theorem proving
% 0.18/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 53.11/14.41 # Version: 3.1.0-ho
% 53.11/14.41 # partial match(2): HMLMSMSMSSLCHFA
% 53.11/14.41 # Preprocessing class: HMLLSMLMSSLCHFA.
% 53.11/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.11/14.41 # Starting new_ho_10 with 1500s (5) cores
% 53.11/14.41 # Starting sh5l with 300s (1) cores
% 53.11/14.41 # Starting new_bool_1 with 300s (1) cores
% 53.11/14.41 # Starting new_bool_2 with 300s (1) cores
% 53.11/14.41 # new_bool_2 with pid 1144 completed with status 0
% 53.11/14.41 # Result found by new_bool_2
% 53.11/14.41 # partial match(2): HMLMSMSMSSLCHFA
% 53.11/14.41 # Preprocessing class: HMLLSMLMSSLCHFA.
% 53.11/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.11/14.41 # Starting new_ho_10 with 1500s (5) cores
% 53.11/14.41 # Starting sh5l with 300s (1) cores
% 53.11/14.41 # Starting new_bool_1 with 300s (1) cores
% 53.11/14.41 # Starting new_bool_2 with 300s (1) cores
% 53.11/14.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 53.11/14.41 # Search class: HGHSM-SMLM32-DHFFFSBN
% 53.11/14.41 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 53.11/14.41 # Starting new_ho_10 with 180s (1) cores
% 53.11/14.41 # new_ho_10 with pid 1145 completed with status 0
% 53.11/14.41 # Result found by new_ho_10
% 53.11/14.41 # partial match(2): HMLMSMSMSSLCHFA
% 53.11/14.41 # Preprocessing class: HMLLSMLMSSLCHFA.
% 53.11/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.11/14.41 # Starting new_ho_10 with 1500s (5) cores
% 53.11/14.41 # Starting sh5l with 300s (1) cores
% 53.11/14.41 # Starting new_bool_1 with 300s (1) cores
% 53.11/14.41 # Starting new_bool_2 with 300s (1) cores
% 53.11/14.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 53.11/14.41 # Search class: HGHSM-SMLM32-DHFFFSBN
% 53.11/14.41 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 53.11/14.41 # Starting new_ho_10 with 180s (1) cores
% 53.11/14.41 # Preprocessing time : 0.217 s
% 53.11/14.41 # Presaturation interreduction done
% 53.11/14.41
% 53.11/14.41 # Proof found!
% 53.11/14.41 # SZS status Theorem
% 53.11/14.41 # SZS output start CNFRefutation
% See solution above
% 53.11/14.41 # Parsed axioms : 11424
% 53.11/14.41 # Removed by relevancy pruning/SinE : 7988
% 53.11/14.41 # Initial clauses : 8989
% 53.11/14.41 # Removed in clause preprocessing : 1956
% 53.11/14.41 # Initial clauses in saturation : 7033
% 53.11/14.41 # Processed clauses : 12946
% 53.11/14.41 # ...of these trivial : 345
% 53.11/14.41 # ...subsumed : 3235
% 53.11/14.41 # ...remaining for further processing : 9366
% 53.11/14.41 # Other redundant clauses eliminated : 2061
% 53.11/14.41 # Clauses deleted for lack of memory : 0
% 53.11/14.41 # Backward-subsumed : 67
% 53.11/14.41 # Backward-rewritten : 125
% 53.11/14.41 # Generated clauses : 80096
% 53.11/14.41 # ...of the previous two non-redundant : 67867
% 53.11/14.41 # ...aggressively subsumed : 0
% 53.11/14.41 # Contextual simplify-reflections : 99
% 53.11/14.41 # Paramodulations : 77972
% 53.11/14.41 # Factorizations : 14
% 53.11/14.41 # NegExts : 0
% 53.11/14.41 # Equation resolutions : 2120
% 53.11/14.41 # Disequality decompositions : 0
% 53.11/14.41 # Total rewrite steps : 32649
% 53.11/14.41 # ...of those cached : 28387
% 53.11/14.41 # Propositional unsat checks : 0
% 53.11/14.41 # Propositional check models : 0
% 53.11/14.41 # Propositional check unsatisfiable : 0
% 53.11/14.41 # Propositional clauses : 0
% 53.11/14.41 # Propositional clauses after purity: 0
% 53.11/14.41 # Propositional unsat core size : 0
% 53.11/14.41 # Propositional preprocessing time : 0.000
% 53.11/14.41 # Propositional encoding time : 0.000
% 53.11/14.41 # Propositional solver time : 0.000
% 53.11/14.41 # Success case prop preproc time : 0.000
% 53.11/14.41 # Success case prop encoding time : 0.000
% 53.11/14.41 # Success case prop solver time : 0.000
% 53.11/14.41 # Current number of processed clauses : 3291
% 53.11/14.41 # Positive orientable unit clauses : 817
% 53.11/14.41 # Positive unorientable unit clauses: 42
% 53.11/14.41 # Negative unit clauses : 319
% 53.11/14.41 # Non-unit-clauses : 2113
% 53.11/14.41 # Current number of unprocessed clauses: 66613
% 53.11/14.41 # ...number of literals in the above : 187257
% 53.11/14.41 # Current number of archived formulas : 0
% 53.11/14.41 # Current number of archived clauses : 5027
% 53.11/14.41 # Clause-clause subsumption calls (NU) : 19175474
% 53.11/14.41 # Rec. Clause-clause subsumption calls : 2552170
% 53.11/14.41 # Non-unit clause-clause subsumptions : 1852
% 53.11/14.41 # Unit Clause-clause subsumption calls : 199887
% 53.11/14.41 # Rewrite failures with RHS unbound : 0
% 53.11/14.41 # BW rewrite match attempts : 1659
% 53.11/14.41 # BW rewrite match successes : 539
% 53.11/14.41 # Condensation attempts : 12946
% 53.11/14.41 # Condensation successes : 46
% 53.11/14.41 # Termbank termtop insertions : 3703432
% 53.11/14.41 # Search garbage collected termcells : 187435
% 53.11/14.41
% 53.11/14.41 # -------------------------------------------------
% 53.11/14.41 # User time : 12.810 s
% 53.11/14.41 # System time : 0.158 s
% 53.11/14.41 # Total time : 12.968 s
% 53.11/14.41 # Maximum resident set size: 48252 pages
% 53.11/14.41
% 53.11/14.41 # -------------------------------------------------
% 53.11/14.41 # User time : 13.640 s
% 53.11/14.41 # System time : 0.188 s
% 53.11/14.41 # Total time : 13.828 s
% 53.11/14.41 # Maximum resident set size: 27412 pages
% 53.11/14.41 % E---3.1 exiting
% 53.11/14.41 % E exiting
%------------------------------------------------------------------------------